Traversing large graphs on GPUs with unified memory
نویسندگان
چکیده
منابع مشابه
Traversing large graphs in realistic settings
The notion of graph traversal is of fundamental importance to solving many computational problems. In many modern applications involving graph traversal such as those arising in the domain of social networks, Internet based services, fraud detection in telephone calls etc., the underlying graph is very large and dynamically evolving. This thesis deals with the design and engineering of traversa...
متن کاملTraversing Probabilistic Graphs
The problem of traversing probabilistic graphs has been studied for a long time. This is because most of the graphs that we come across, whether it is a network of roads or a set of network links are probabilistic in nature. A probabilistic graph is one where there is a probability associated with the existence of every edge. We examine the problem of nding the best strategy for reaching a give...
متن کاملMemory Formation: Traversing the Highwire
Molecules that suppress memory formation protect against the consolidation of inaccurate information. A recent study in Drosophila has identified a new pathway for memory suppression and the neurons that are a gateway to long-term memory formation.
متن کاملTraversing Environments Using Possibility Graphs with Multiple Action Types
Locomotion for legged robots poses considerable challenges when confronted by obstacles and adverse environments. Footstep planners are typically only designed for one mode of locomotion, but traversing unfavorable environments may require several forms of locomotion to be sequenced together, such as walking, crawling, and jumping. Multi-modal motion planners can be used to address some of thes...
متن کاملTraversing Knowledge Graphs in Vector Space
Path queries on a knowledge graph can be used to answer compositional questions such as “What languages are spoken by people living in Lisbon?”. However, knowledge graphs often have missing facts (edges) which disrupts path queries. Recent models for knowledge base completion impute missing facts by embedding knowledge graphs in vector spaces. We show that these models can be recursively applie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the VLDB Endowment
سال: 2020
ISSN: 2150-8097
DOI: 10.14778/3384345.3384358